Relaxed sequencing games have a nonempty core
نویسندگان
چکیده
منابع مشابه
Relaxed sequencing games have a nonempty core∗
We study sequencing situations with a fixed initial order and linear cost functions. In these sequencing situations cost savings can be obtained by rearranging jobs. When the jobs are owned by different players, next to the issue of finding an optimal order, the division of these cost savings forms an additional issue. Cooperative game theory studies this issue by taking into account that group...
متن کاملSufficient Conditions for Nonempty Core of Minimum Cost Forest Games
This paper studies problems of establishing a minimum cost network and of determining a fair cost allocation among customers. Each supplier offers a different type of service to the customers, and each customer wishes to be connected with the suppliers which he needs. The characteristic function game is deduced from minimum costs for constructing subnetworks. By introducing an equivalence relat...
متن کاملOn the balancedness of relaxed sequencing games
This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced.
متن کاملA Nonempty Extension of the Core
This paper gives a new characterisation of the dynamic solution of Shenoy for characteristic function games with myopic players. This solution is an extension to the core that is never empty. Our main result is the proof that for games with nonempty cores the core and the dynamic solution yield the same results.
متن کاملNo. 2002-49 ON THE BALANCEDNESS OF RELAXED SEQUENCING GAMES
This paper shows that some classes of relaxed sequencing games, which arise from the class of sequencing games as introduced in Curiel, Pederzoli, Tijs (1989), are balanced.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Naval Research Logistics
سال: 2006
ISSN: 0894-069X,1520-6750
DOI: 10.1002/nav.20137